On the reducibility of polynomials with integer coefficiens modulo $p$ with prime $p$.
نویسندگان
چکیده
منابع مشابه
Irreducible Quartic Polynomials with Factorizations modulo p
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with ...
متن کاملPolynomials with Roots modulo Every Integer
Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not the polynomial has a root modulo every non-zero integer.
متن کاملOn Hadamard Modulo Prime p Matrices of Size at most 2 p + 1 1
In this note, we continue the study of Hadamard Modulo Prime (HMP) matrices initialized in recent articles [5] – [6]. Namely, we have present some new non-existence and classification results for HMP matrices whose size is relatively small with respect to the modulo.
متن کاملProducts Of Quadratic Polynomials With Roots Modulo Any Integer
We classify products of three quadratic polynomials, each irreducible over Q, which are solvable modulo m for every integer m > 1 but have no roots over the rational numbers. Polynomials with this property are known as intersective polynomials. We use Hensel’s Lemma and a refined version of Hensel’s Lemma to complete the proof. Mathematics Subject Classification: 11R09
متن کاملAlmost Prime Orders of CM Elliptic Curves Modulo p
Let E/Q be an elliptic curve over the rationals and, for any prime p, let us denote by |E(Fp)| the number of Fp points of the reduced curve modulo p. Consider the function ΠE,s(x) = #{p ≤ x : |E(Fp)| = Ps}, where Ps denotes a squarefree number with at most s prime divisors. In particular P1 denotes a prime number. In 1988 Koblitz, motivated by criptographic applications, (see [1]), conjectured ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1937
ISSN: 1802-114X
DOI: 10.21136/cpmf.1937.121487